package com.zhupf.graph;

import sun.applet.AppletResourceLoader;

/**
 * @author zhupf
 * @date 2023年12月18日 10:22
 * @Description
 *
 * 200. 岛屿数量
 *
 * 给你一个由 '1'（陆地）和 '0'（水）组成的的二维网格，请你计算网格中岛屿的数量。
 *
 * 岛屿总是被水包围，并且每座岛屿只能由水平方向和/或竖直方向上相邻的陆地连接形成。
 *
 * 此外，你可以假设该网格的四条边均被水包围。
 *
 * 示例 1：
 *
 * 输入：grid = [
 *   ["1","1","1","1","0"],
 *   ["1","1","0","1","0"],
 *   ["1","1","0","0","0"],
 *   ["0","0","0","0","0"]
 * ]
 * 输出：1
 */
public class NumIslands {

    public static void main(String[] args) {
        char f = '1';
        System.out.println(f == '1');
    }

    public int numIslands(char[][] grid) {
        int ans = 0;
        for (int i = 0; i < grid.length; i++) {
            for (int j = 0; j < grid[i].length; j++) {
                if(grid[i][j] == '1'){
                    process(grid,i,j);
                    ans++;
                }
            }



        }
        return ans;
    }

    public void process(char[][] grid, int j ,int  k){
        if(j<0 || j >= grid.length || k < 0 || k >= grid[j].length || grid[j][k] == '0' || grid[j][k] == '2'){
            return ;
        }
        grid[j][k] = '2';
        process(grid,j+1,k);
        process(grid,j-1,k);
        process(grid,j,k+1);
        process(grid,j,k-1);
    }
}
